Sharp <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e2749" altimg="si4.svg"><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>-norm error estimates of two time-stepping schemes for reaction–subdiffusion problems
نویسندگان
چکیده
Due to the intrinsically initial singularity of solution and discrete convolution form in numerical Caputo derivatives, traditional H1-norm analysis (corresponding case for a classical diffusion equation) time approximations fractional subdiffusion problem always leads suboptimal error estimates (a loss accuracy). To recover theoretical accuracy time, we propose an improved Grönwall inequality apply it well-known L1 formula Crank–Nicolson scheme. With help time-space error-splitting technique global consistency analysis, sharp two nonuniform approaches are established reaction–subdiffusion problems. Numerical experiments included confirm sharpness our analysis.
منابع مشابه
Error Estimates for Discontinuous Galerkin Time-Stepping Schemes for Robin Boundary Control Problems Constrained to Parabolic PDEs
We consider fully discrete finite element approximations of a Robin optimal boundary control problem, constrained by linear parabolic PDEs with rough initial data. Conforming finite element methods for spatial discretization combined with discontinuous time-stepping Galerkin schemes are being used for the space-time discretization. Error estimates are proved under weak regularity hypotheses for...
متن کاملSymmetric error estimates for discontinuous Galerkin time-stepping schemes for optimal control problems constrained to evolutionary Stokes equations
Abstract. We consider fully discrete finite element approximations of a distributed optimal control problem, constrained by the evolutionary Stokes equations. Conforming finite element methods for spatial discretization combined with discontinuous time-stepping Galerkin schemes are being used for the space-time discretization. Error estimates are proved under weak regularity hypotheses for the ...
متن کاملSuper-time-stepping Acceleration of Explicit Schemes for Parabolic Problems
The goal of the paper is to bring to the attention of the computational community a long overlooked, very simple, acceleration method that impressively speeds up explicit time-stepping schemes, at essentially no extra cost. The authors explain the basis of the method, namely stabilization via wisely chosen inner steps (stages), justify it for linear problems, and spell out how simple it is to i...
متن کاملSilent error detection in numerical time-stepping schemes
Errors due to hardware or low level software problems, if detected, can be fixed by various schemes, such as recomputation from a checkpoint. Silent errors are errors in application state that have escaped low-level error detection. At extreme scale, where machines can perform astronomically many operations per second, silent errors threaten the validity of computed results. We propose a new pa...
متن کاملApplication of the Norm Estimates for Univalence of Analytic Functions
By using norm estimates of the pre-Schwarzian derivatives for certain family of analytic functions, we shall give simple sufficient conditions for univalence of analytic functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2021
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2020.113352